## Uses of Class
oracle.pgx.api.EdgeProperty

- Packages that use EdgeProperty
  Package | Description
  --- | ---
  oracle.pgx.api | This package contains the Java APIs of PGX.

- - ### Uses of EdgeProperty in oracle.pgx.api

    Fields in oracle.pgx.api with type parameters of type EdgeProperty
    Modifier and Type | Field and Description
    --- | ---
    `static Set<EdgeProperty<?>>` | EdgeProperty.`ALL`
    `static Set<EdgeProperty<?>>` | EdgeProperty.`NONE`

    Methods in oracle.pgx.api that return EdgeProperty
    Modifier and Type | Method and Description
    --- | ---
    `<V extends Comparable<V>> EdgeProperty<V>` | PgxGraph.`createEdgeProperty(PropertyType type)` Blocking version of `#createEdgePropertyAsync()`.
    `<V extends Comparable<V>> EdgeProperty<V>` | PgxGraph.`createEdgeProperty(PropertyType type, String name)` Blocking version of `#createEdgePropertyAsync()`.
    `<V extends Comparable<V>> EdgeProperty<V>` | PgxGraph.`getEdgeProperty(String name)` Blocking version of `#getEdgePropertyAsync()`.

    Methods in oracle.pgx.api that return types with arguments of type EdgeProperty
    Modifier and Type | Method and Description
    --- | ---
    `<V extends Comparable<V>> PgxFuture<EdgeProperty<V>>` | PgxGraph.`createEdgePropertyAsync(PropertyType type)` Creates a session-bound edge property
    `<V extends Comparable<V>> PgxFuture<EdgeProperty<V>>` | PgxGraph.`createEdgePropertyAsync(PropertyType type, String name)` Creates a session-bound edge property
    `Set<EdgeProperty<?>>` | PgxGraph.`getEdgeProperties()` Blocking version of `PgxGraph.getEdgePropertiesAsync()`.
    `PgxFuture<Set<EdgeProperty<?>>>` | PgxGraph.`getEdgePropertiesAsync()` Get the set of edge properties belonging to this graph.
    `<V extends Comparable<V>> PgxFuture<EdgeProperty<V>>` | PgxGraph.`getEdgePropertyAsync(String name)` get an edge property of this graph

    Methods in oracle.pgx.api with parameters of type EdgeProperty
    Modifier and Type | Method and Description
    --- | ---
    `<ID extends Comparable<ID>> VertexProperty<ID,Double>` | Analyst.`closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<Double> cost)` Blocking version of `#closenessCentralityDoubleLengthAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>` | Analyst.`closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<Double> cost)` Compute closed centrality.
    `<ID extends Comparable<ID>> AllPaths<ID>` | PgxGraph.`createAllPaths(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createAllPathsAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | PgxGraph.`createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `AllPaths` object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
    `<ID extends Comparable<ID>> PgxPath<ID>` | PgxGraph.`createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createPathAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | PgxGraph.`createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `PgxPath` object representing the shortest path from one source to one destination (shortest regarding the given edge costs).
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`fattestPath(PgxGraph graph, ID rootId, EdgeProperty<Double> capacity)` Convenience wrapper around `Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty)` taking a vertex ID instead of a `PgxVertex`.
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity)` Blocking version of `#fattestPathAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | Analyst.`fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity)` Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<Double> cost)` Convenience wrapper around `Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty)` taking a vertex ID instead of `PgxVertex`.
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Blocking version of `#shortestPathBellmanFordAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | Analyst.`shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Compute single source shortest paths using Bellman & Ford algorithm time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<Double> cost)` Convenience wrapper around `Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty)` taking a vertex ID instead of `PgxVertex`.
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Blocking version of `#shortestPathBellmanFordReverseAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | Analyst.`shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Compute reverse single source shortest paths using Bellman & Ford algorithm time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost)` Convenience wrapper around `Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)` taking vertex IDs instead of `PgxVertex`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Blocking version of `#shortestPathDijkstraAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Compute shortest path using Dijkstra's algorithm.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost)` Convenience wrapper around `Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)` taking vertex IDs instead of `PgxVertex`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Blocking version of `#shortestPathDijkstraBidirectionalAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Compute shortest path using a bi-directional Dijkstra variant.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost, GraphFilter filterExpr)` Convenience wrapper around `Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)` taking vertex IDs instead of `PgxVertex`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost, GraphFilter filterExpr)` Convenience wrapper around `Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)` taking vertex IDs instead of `PgxVertex`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraBidirectionalAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.

    Method parameters in oracle.pgx.api with type arguments of type EdgeProperty
    Modifier and Type | Method and Description
    --- | ---
    `BipartiteGraph` | PgxGraph.`bipartiteSubGraphFromLeftSet(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName)` Blocking version of `#bipartiteSubGraphFromLeftSetAsync()`.
    `BipartiteGraph` | PgxGraph.`bipartiteSubGraphFromLeftSet(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName, String isLeftPropName)` Blocking version of `#bipartiteSubGraphFromLeftSetAsync()`.
    `PgxFuture<BipartiteGraph>` | PgxGraph.`bipartiteSubGraphFromLeftSetAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName)` Create a bipartite version of a graph.
    `PgxFuture<BipartiteGraph>` | PgxGraph.`bipartiteSubGraphFromLeftSetAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName, String isLeftPropName)`
    `PgxGraph` | PgxGraph.`clone(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, String newGraphName)` Blocking version of `PgxGraph.cloneAsync()`.
    `PgxFuture<PgxGraph>` | PgxGraph.`cloneAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, String newGraphName)` Create a copy of a graph.
    `PgxGraph` | PgxGraph.`filter(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName)` Blocking version of `#filterAsync()`.
    `PgxFuture<PgxGraph>` | PgxGraph.`filterAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName)` Create a subgraph of a graph.
    `PgxGraph` | PgxGraph.`simplify(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)` Blocking version of `#simplifyAsync()`.
    `PgxFuture<PgxGraph>` | PgxGraph.`simplifyAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)` Create a simplified version of a graph.
    `PgxGraph` | PgxGraph.`sortByDegree(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName)` Blocking version of `PgxGraph.sortByDegreeAsync()`.
    `PgxFuture<PgxGraph>` | PgxGraph.`sortByDegreeAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName)` Create a sorted version of a graph and all its properties.
    `PgxGraph` | PgxGraph.`sparsify(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, double e, String newGraphName)` Blocking version of `#sparsifyAsync()`.
    `PgxFuture<PgxGraph>` | PgxGraph.`sparsifyAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, double e, String newGraphName)` Sparsifies the given graph and returns a new graph with less edges.
    `FileGraphConfig` | PgxGraph.`store(Format targetFormat, String targetPath, Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, boolean overwrite)` Blocking version of `PgxGraph.storeAsync(Format, String, Collection, Collection, boolean)`.
    `PgxFuture<FileGraphConfig>` | PgxGraph.`storeAsync(Format targetFormat, String targetPath, Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, boolean overwrite)`

Copyright © 2015. All rights reserved.